On Supersaturation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crystal Nucleation without Supersaturation.

Classical nucleation theory (CNT) has been extensively employed to interpret crystal nucleation phenomena and postulates the formation of an ordered crystalline nucleus directly from vapor or solution. Here, we provide the first experimental demonstration of a two-step mechanism that facilitates deposition of crystals on solid surfaces from vapor. Crucially, this occurs from saturated vapor wit...

متن کامل

Supersaturation for hereditary properties

Let F be a collection of r-uniform hypergraphs, and let 0 < p < 1. It is known that there exists c = c(p,F) such that the probability of a random r-graph in G(n, p) not containing an induced subgraph from F is 2(−c+o(1))( n r). Let each r-graph in F have at least t vertices. We show that in fact for every > 0, there exists δ = δ( , p,F) > 0 such that the probability of a random r-graph in G(n, ...

متن کامل

Supersaturation in the Boolean lattice

We prove a “supersaturation-type” extension of both Sperner’s Theorem (1928) and its generalization by Erdős (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking themiddle (k−1) rows of the Boolean lattice and x elements from the kthmiddle r...

متن کامل

The dependence of homogeneous nucleation rate on supersaturation.

The claim that classical nucleation theory (CNT) correctly predicts the dependence on supersaturation of the steady-state rate of homogeneous nucleation is reexamined in light of recent experimental studies of nucleation of a range of substances, including water, argon, nitrogen, and several 1-alcohols. Based on these studies (which include, for water, a compilation of nine different studies), ...

متن کامل

Supersaturation For Ramsey-Turán Problems

For an l-graph G, the Turán number ex(n,G) is the maximum number of edges in an n-vertex l-graph H containing no copy of G. The limit π(G) = limn→∞ ex (n,G)/ ( n l ) is known to exist [8]. The Ramsey-Turán density ρ(G) is defined similarly to π(G) except that we restrict to only those H with independence number o(n). A result of Erdős and Sós [3] states that π(G) = ρ(G) as long as for every edg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1879

ISSN: 0028-0836,1476-4687

DOI: 10.1038/020349b0